Incomplete data problems in X-ray computerized tomography

Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4     

Partially Classical States of a Boson Field

Employing positive-definiteness arguments we analyse Boson field states, which combine classical and quantum mechanical features (signal and noise), in a constructive manner. Mathematically, they constitute Bauer simplexes within the convex, weak-*-compact state space of the C*-Weyl algebra, defined by a presymplectic test function space (smooth one-Boson wave functions) and are affinely homeomorphic to a state space of a classical field. The regular elements are expressed in terms of weak distributions (probability premeasures) on the dual test function space. The Bauer simplex arising from the bare vacuum is shown to generalize the quantum optical photon field states with positive P-functions.     

Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently

Logic programming languages, such asProlog, allow a declarative specification of Constraint Satisfaction Problems (CSPs), freeing the user from specifying more or less complex control directives. However, the price to pay for such flexibility is a loss of efficiency, which makes Logic Programming inadequate to solve CSPs of even moderate size and complexity. To extend the range of applicability of logic programming, several improvements have been proposed. The use of heuristics is one such improvement. Although this usually forces the user to specify some form of control (thus abandoning the pure declarative nature of a logic program), these specifications can be made declarative by making use of some appropriate meta-predicates. Another extension to logic programming that improves its efficiency, is the active use of constraints, as done in the various formulations of constraint logic programming languages. In particular, the use of finite domains is quite adequate to implement look-ahead schemes to efficiently solve several types of CSPs. In this paper, we discuss the complementary nature of heuristics and look-ahead schemes and present a constraint logic programming framework that integrates both these techniques. Results obtained with a time-tabling problem executed on a prototype that implements such a framework are presented, and show that significant efficiency improvements can be achieved when compared with the separate use of the two techniques.     

Eigenvalue problem for arbitrary linear combinations of a boson annihilation and creation operator

The eigenvalue problem for arbitrary linear combinations kα + μα^? of a boson annihilation operator α and a boson creation operator α^? is solved. It is shown that these operators possess nondegenerate eigenstates to arbitrary complex eigenvalues. The expansion of these eigenstates into the basic set of number states | n >, (n = 0, 1, 2, …), is found. The eigenstates are normalizable and are therefore states of a Hilbert space for | ζ | < 1 with ζ ? μ/k and represent in this case squeezed coherent states of minimal uncertainty product. They can be considered as states of a rigged Hilbert space for | ζ | ? 1. A completeness relation for these states is derived that generalizes the completeness relation for the coherent states | α 〉. Furthermore, it is shown that there exists a dual orthogonality in the entire set of these states and a connected dual completeness of the eigenstates on widely arbitrary paths over the complex plane of eigenvalues. This duality goes over into a selfduality of the eigenstates of the hermitian operators kα + k* α^? to real eigenvalues. The usually as nonexistent considered eigenstates of the boson creation operator α^? are obtained by a limiting procedure. They belong to the most singular case among the considered general class of eigenstates with ζ ? μ/k as a parameter.     

On-line extraction and determination of carbofuran in raw milk by direct HPLC injection on an ISRP column

Summary A method has been developed for extraction and determination of carbofuran in milk. The method involved direct injection of raw milk on to a human serum albumin dimethyloctyl-silica gel (HSA-C₈) column and the use of 80:20 (v/v) 0.01 M phosphate buffer pH 5.5-acetonitrile as mobile phase. UV spectrophotometric detection was performed at 220 nm. Identification was based on retention time. Quantification was performed by automatic peak-area determination and was calibrated by use of an external standard.